Leant a P: Lean Tableau-based Theorem Proving
نویسنده
چکیده
implements a rst-order theorem prover based on free-variable semantic tableaux. It is complete, sound, and eecient.
منابع مشابه
leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
leanCoP is a very compact theorem prover for classical firstorder logic, based on the connection (tableau) calculus and implemented in Prolog. leanCoP 2.0 enhances leanCoP 1.0 by adding regularity, lemmata, and a technique for restricting backtracking. It also provides a definitional translation into clausal form and integrates “Prolog technology” into a lean theorem prover. ileanCoP is a compa...
متن کاملleanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract)
“prove((E,F),A,B,C,D) :!, prove(E,[F|A],B,C,D). prove((E;F),A,B,C,D) :!, prove(E,A,B,C,D), prove(F,A,B,C,D). prove(all(H,I),A,B,C,D) :!, \+length(C,D), copy_term((H,I,C),(G,F,C)), append(A,[all(H,I)],E), prove(F,E,B,[G|C],D). prove(A,_,[C|D],_,_) :((A= -(B); -(A)=B)) -> (unify(B,C); prove(A,[],D,_,_)). prove(A,[E|F],B,C,D) :prove(E,F,[A|B],C,D).” implements a first-order theorem prover based on...
متن کاملLean Theorem Proving: Maximal Efficiency from Minimal Means
5 prove(Lit,[Next|UnExp],Lits,FreeV,VLim) :prove(Next,UnExp,[Lit|Lits],FreeV,VLim). plain that there are sparse applications of the techniques they develop. One reason might be that implementation-oriented research favors huge and highly complex systems. It is hard to see how to apply these besides using them as a black box. Adaptability, however, is an important criterion for applying techniqu...
متن کاملA Tableau Based Automated Theorem Prover Using High Performance Computing
Automated Theorem Proving systems are enormously powerful computer programs capable of solving immensely difficult problems. The extreme capabilities of these systems lie on some well-established proof systems, such as Semantic tableau. It is used to prove the validity of a formula by contradiction and it can produce a counterexample if it fails. It can also be used to prove whether a formula i...
متن کاملProof Confluent Tableau Calculi
A tableau calculus is proof confluent if every partial tableau proof for an unsatisfiable formula can be extended to a closed tableau. A rule application may be redundant but it can never prevent the construction of a proof; there are no “dead ends” in the proof search. Proof confluence is a prerequisite of (a) backtrackingfree proof search and (b) the generation of counter examples to non-theo...
متن کامل